The double-padlock problem: is secure classical information transmission possible without key exchange?

نویسندگان

  • James M. Chappell
  • Derek Abbott
چکیده

The idealized Kish-Sethuraman (KS) cipher is known to offer perfect information theoretical security with classical physical means. However, realization of the protocol is hitherto an open problem, as the required mathematical operators have not been identified in the previous literature. A mechanical analogy of this protocol can be seen as sending a message in a box using two padlocks; one locked by the Sender and the other locked by the Receiver, so that theoretically the message remains secure at all times. We seek a mathematical representation of this process, considering that it would be very unusual if there was a physical process with no mathematical description and indeed we find a solution within a three and four dimensional Clifford algebra. The significance of finding a mathematical description that describes the protocol, is that it is a possible step toward a classical physical realization having benefits in increased security with reduced complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A traceable optimistic fair exchange protocol in the standard model

An Optimistic Fair Exchange (OFE) protocol is a good way for two parties to exchange their digital items in a fair way such that at the end of the protocol execution, both of them receive their items or none of them receive anything. In an OFE protocol there is a semi-trusted third party, named arbitrator, which involves in the protocol if it is necessary. But there is a security problem when a...

متن کامل

Quantum Key Distribution in the Classical Authenticated Key Exchange Framework

Key establishment is a crucial primitive for building secure channels in a multi-party setting. Without quantum mechanics, key establishment can only be done under the assumption that some computational problem is hard. Since digital communication can be easily eavesdropped and recorded, it is important to consider the secrecy of information anticipating future algorithmic and computational dis...

متن کامل

A NEW PROTOCOL MODEL FOR VERIFICATION OF PAYMENT ORDER INFORMATION INTEGRITY IN ONLINE E-PAYMENT SYSTEM USING ELLIPTIC CURVE DIFFIE-HELLMAN KEY AGREEMENT PROTOCOL

Two parties that conduct a business transaction through the internet do not see each other personally nor do they exchange any document neither any money hand-to-hand currency. Electronic payment is a way by which the two parties transfer the money through the internet. Therefore integrity of payment and order information of online purchase is an important concern. With online purchase the cust...

متن کامل

Totally Secure Classical Networks with Multipoint Telecloning (teleportation) of Classical Bits through Loops with Johnson-like Noise

First, we show a new inexpensive defense against intruders and the man-in-the-middle attack in the Kirchhoff's-loop-Johnson-like-noise (KLJN) cipher. Then instead of point-to-point communication, we propose a high efficiency, secure network. The (in the idealistic case totally secure) classical network is based on an improved version of the KLJN cipher. The network consists of two parallel netw...

متن کامل

SECOQC Business White Paper

1 ABSTRACT In contemporary cryptographic systems, secret keys are usually exchanged by means of methods, which suffer from mathematical and technology inherent drawbacks. That could lead to unnoticed complete compromise of cryptographic systems, without a chance of control by its legitimate owners. Therefore a need for innovative solutions exists when truly and reliably secure transmission of s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012